TSTP Solution File: GEG015^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEG015^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:57:08 EDT 2024
% Result : Theorem 0.25s 0.50s
% Output : Refutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GEG015^1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.39 % Computer : n009.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Sat May 18 21:57:23 EDT 2024
% 0.15/0.40 % CPUTime :
% 0.15/0.40 This is a TH0_THM_EQU_NAR problem
% 0.15/0.40 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.42 % (9030)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.25/0.42 % (9033)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.25/0.42 % (9032)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.25/0.42 % (9031)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.25/0.42 % (9034)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.25/0.42 % (9029)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.25/0.42 % (9035)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.25/0.42 % (9036)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.25/0.42 % (9032)Instruction limit reached!
% 0.25/0.42 % (9032)------------------------------
% 0.25/0.42 % (9032)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.42 % (9032)Termination reason: Unknown
% 0.25/0.42 % (9032)Termination phase: shuffling
% 0.25/0.42 % (9033)Instruction limit reached!
% 0.25/0.42 % (9033)------------------------------
% 0.25/0.42 % (9033)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.42 % (9033)Termination reason: Unknown
% 0.25/0.42 % (9033)Termination phase: shuffling
% 0.25/0.42
% 0.25/0.42 % (9033)Memory used [KB]: 1023
% 0.25/0.42 % (9033)Time elapsed: 0.003 s
% 0.25/0.42 % (9033)Instructions burned: 3 (million)
% 0.25/0.42 % (9033)------------------------------
% 0.25/0.42 % (9033)------------------------------
% 0.25/0.42
% 0.25/0.42 % (9032)Memory used [KB]: 1023
% 0.25/0.42 % (9032)Time elapsed: 0.003 s
% 0.25/0.42 % (9032)Instructions burned: 2 (million)
% 0.25/0.42 % (9032)------------------------------
% 0.25/0.42 % (9032)------------------------------
% 0.25/0.42 % (9036)Instruction limit reached!
% 0.25/0.42 % (9036)------------------------------
% 0.25/0.42 % (9036)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.42 % (9036)Termination reason: Unknown
% 0.25/0.42 % (9036)Termination phase: shuffling
% 0.25/0.42
% 0.25/0.42 % (9036)Memory used [KB]: 1023
% 0.25/0.42 % (9036)Time elapsed: 0.003 s
% 0.25/0.42 % (9036)Instructions burned: 3 (million)
% 0.25/0.42 % (9036)------------------------------
% 0.25/0.42 % (9036)------------------------------
% 0.25/0.42 % (9030)Instruction limit reached!
% 0.25/0.42 % (9030)------------------------------
% 0.25/0.42 % (9030)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.42 % (9030)Termination reason: Unknown
% 0.25/0.42 % (9030)Termination phase: shuffling
% 0.25/0.42
% 0.25/0.42 % (9030)Memory used [KB]: 1151
% 0.25/0.42 % (9030)Time elapsed: 0.004 s
% 0.25/0.42 % (9030)Instructions burned: 4 (million)
% 0.25/0.42 % (9030)------------------------------
% 0.25/0.42 % (9030)------------------------------
% 0.25/0.43 % (9034)Refutation not found, incomplete strategy
% 0.25/0.43 % (9034)------------------------------
% 0.25/0.43 % (9034)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.43 % (9034)Termination reason: Refutation not found, incomplete strategy
% 0.25/0.43
% 0.25/0.43
% 0.25/0.43 % (9034)Memory used [KB]: 5628
% 0.25/0.43 % (9034)Time elapsed: 0.008 s
% 0.25/0.43 % (9034)Instructions burned: 11 (million)
% 0.25/0.43 % (9034)------------------------------
% 0.25/0.43 % (9034)------------------------------
% 0.25/0.43 % (9035)Instruction limit reached!
% 0.25/0.43 % (9035)------------------------------
% 0.25/0.43 % (9035)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.43 % (9035)Termination reason: Unknown
% 0.25/0.43 % (9035)Termination phase: Saturation
% 0.25/0.43
% 0.25/0.43 % (9035)Memory used [KB]: 5628
% 0.25/0.43 % (9035)Time elapsed: 0.011 s
% 0.25/0.43 % (9035)Instructions burned: 18 (million)
% 0.25/0.43 % (9035)------------------------------
% 0.25/0.43 % (9035)------------------------------
% 0.25/0.43 % (9031)Instruction limit reached!
% 0.25/0.43 % (9031)------------------------------
% 0.25/0.43 % (9031)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.43 % (9031)Termination reason: Unknown
% 0.25/0.43 % (9031)Termination phase: Saturation
% 0.25/0.43
% 0.25/0.43 % (9031)Memory used [KB]: 5756
% 0.25/0.43 % (9031)Time elapsed: 0.016 s
% 0.25/0.44 % (9031)Instructions burned: 27 (million)
% 0.25/0.44 % (9031)------------------------------
% 0.25/0.44 % (9031)------------------------------
% 0.25/0.44 % (9039)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.25/0.44 % (9038)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.25/0.44 % (9037)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.25/0.44 % (9040)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.25/0.44 % (9039)Instruction limit reached!
% 0.25/0.44 % (9039)------------------------------
% 0.25/0.44 % (9039)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.44 % (9039)Termination reason: Unknown
% 0.25/0.44 % (9039)Termination phase: shuffling
% 0.25/0.44
% 0.25/0.44 % (9039)Memory used [KB]: 1023
% 0.25/0.44 % (9039)Time elapsed: 0.003 s
% 0.25/0.44 % (9039)Instructions burned: 3 (million)
% 0.25/0.44 % (9039)------------------------------
% 0.25/0.44 % (9039)------------------------------
% 0.25/0.44 % (9041)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.25/0.45 % (9038)Instruction limit reached!
% 0.25/0.45 % (9038)------------------------------
% 0.25/0.45 % (9038)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.45 % (9038)Termination reason: Unknown
% 0.25/0.45 % (9038)Termination phase: Saturation
% 0.25/0.45
% 0.25/0.45 % (9038)Memory used [KB]: 1151
% 0.25/0.45 % (9038)Time elapsed: 0.009 s
% 0.25/0.45 % (9038)Instructions burned: 15 (million)
% 0.25/0.45 % (9038)------------------------------
% 0.25/0.45 % (9038)------------------------------
% 0.25/0.45 % (9042)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.25/0.45 % (9041)Instruction limit reached!
% 0.25/0.45 % (9041)------------------------------
% 0.25/0.45 % (9041)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.45 % (9041)Termination reason: Unknown
% 0.25/0.45 % (9041)Termination phase: Property scanning
% 0.25/0.45
% 0.25/0.45 % (9041)Memory used [KB]: 1151
% 0.25/0.45 % (9041)Time elapsed: 0.006 s
% 0.25/0.45 % (9041)Instructions burned: 7 (million)
% 0.25/0.45 % (9041)------------------------------
% 0.25/0.45 % (9041)------------------------------
% 0.25/0.45 % (9043)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.25/0.45 % (9043)Instruction limit reached!
% 0.25/0.45 % (9043)------------------------------
% 0.25/0.45 % (9043)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.45 % (9043)Termination reason: Unknown
% 0.25/0.45 % (9043)Termination phase: shuffling
% 0.25/0.45
% 0.25/0.45 % (9043)Memory used [KB]: 1023
% 0.25/0.45 % (9043)Time elapsed: 0.004 s
% 0.25/0.45 % (9043)Instructions burned: 4 (million)
% 0.25/0.45 % (9043)------------------------------
% 0.25/0.45 % (9043)------------------------------
% 0.25/0.46 % (9042)Instruction limit reached!
% 0.25/0.46 % (9042)------------------------------
% 0.25/0.46 % (9042)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.46 % (9044)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.25/0.46 % (9042)Termination reason: Unknown
% 0.25/0.46 % (9042)Termination phase: Saturation
% 0.25/0.46
% 0.25/0.46 % (9042)Memory used [KB]: 5628
% 0.25/0.46 % (9042)Time elapsed: 0.011 s
% 0.25/0.46 % (9042)Instructions burned: 17 (million)
% 0.25/0.46 % (9042)------------------------------
% 0.25/0.46 % (9042)------------------------------
% 0.25/0.46 % (9044)Instruction limit reached!
% 0.25/0.46 % (9044)------------------------------
% 0.25/0.46 % (9044)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.46 % (9044)Termination reason: Unknown
% 0.25/0.46 % (9044)Termination phase: shuffling
% 0.25/0.46
% 0.25/0.46 % (9044)Memory used [KB]: 1023
% 0.25/0.46 % (9044)Time elapsed: 0.004 s
% 0.25/0.46 % (9044)Instructions burned: 4 (million)
% 0.25/0.46 % (9044)------------------------------
% 0.25/0.46 % (9044)------------------------------
% 0.25/0.46 % (9037)Instruction limit reached!
% 0.25/0.46 % (9037)------------------------------
% 0.25/0.46 % (9037)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.46 % (9037)Termination reason: Unknown
% 0.25/0.46 % (9037)Termination phase: Saturation
% 0.25/0.46
% 0.25/0.46 % (9037)Memory used [KB]: 5756
% 0.25/0.46 % (9037)Time elapsed: 0.022 s
% 0.25/0.46 % (9037)Instructions burned: 38 (million)
% 0.25/0.46 % (9037)------------------------------
% 0.25/0.46 % (9037)------------------------------
% 0.25/0.46 % (9045)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.25/0.46 % (9046)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.25/0.46 % (9045)Instruction limit reached!
% 0.25/0.46 % (9045)------------------------------
% 0.25/0.46 % (9045)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.46 % (9045)Termination reason: Unknown
% 0.25/0.46 % (9045)Termination phase: Property scanning
% 0.25/0.46
% 0.25/0.46 % (9045)Memory used [KB]: 1151
% 0.25/0.46 % (9045)Time elapsed: 0.005 s
% 0.25/0.46 % (9045)Instructions burned: 7 (million)
% 0.25/0.46 % (9045)------------------------------
% 0.25/0.46 % (9045)------------------------------
% 0.25/0.47 % (9046)Instruction limit reached!
% 0.25/0.47 % (9046)------------------------------
% 0.25/0.47 % (9046)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.47 % (9046)Termination reason: Unknown
% 0.25/0.47 % (9046)Termination phase: shuffling
% 0.25/0.47
% 0.25/0.47 % (9046)Memory used [KB]: 1151
% 0.25/0.47 % (9046)Time elapsed: 0.004 s
% 0.25/0.47 % (9046)Instructions burned: 4 (million)
% 0.25/0.47 % (9046)------------------------------
% 0.25/0.47 % (9046)------------------------------
% 0.25/0.47 % (9047)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.25/0.47 % (9047)Instruction limit reached!
% 0.25/0.47 % (9047)------------------------------
% 0.25/0.47 % (9047)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.47 % (9047)Termination reason: Unknown
% 0.25/0.47 % (9047)Termination phase: shuffling
% 0.25/0.47
% 0.25/0.47 % (9047)Memory used [KB]: 1151
% 0.25/0.47 % (9047)Time elapsed: 0.004 s
% 0.25/0.47 % (9047)Instructions burned: 4 (million)
% 0.25/0.47 % (9047)------------------------------
% 0.25/0.47 % (9047)------------------------------
% 0.25/0.47 % (9048)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.25/0.47 % (9049)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.25/0.47 % (9050)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.25/0.48 % (9050)Instruction limit reached!
% 0.25/0.48 % (9050)------------------------------
% 0.25/0.48 % (9050)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.48 % (9050)Termination reason: Unknown
% 0.25/0.48 % (9050)Termination phase: Property scanning
% 0.25/0.48
% 0.25/0.48 % (9050)Memory used [KB]: 1151
% 0.25/0.48 % (9050)Time elapsed: 0.005 s
% 0.25/0.48 % (9050)Instructions burned: 6 (million)
% 0.25/0.48 % (9050)------------------------------
% 0.25/0.48 % (9050)------------------------------
% 0.25/0.48 % (9051)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.25/0.48 % (9052)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.25/0.48 % (9048)Instruction limit reached!
% 0.25/0.48 % (9048)------------------------------
% 0.25/0.48 % (9048)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.48 % (9048)Termination reason: Unknown
% 0.25/0.48 % (9048)Termination phase: Saturation
% 0.25/0.48
% 0.25/0.48 % (9048)Memory used [KB]: 5756
% 0.25/0.48 % (9048)Time elapsed: 0.034 s
% 0.25/0.48 % (9048)Instructions burned: 18 (million)
% 0.25/0.48 % (9048)------------------------------
% 0.25/0.48 % (9048)------------------------------
% 0.25/0.49 % (9051)Refutation not found, incomplete strategy
% 0.25/0.49 % (9051)------------------------------
% 0.25/0.49 % (9051)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.49 % (9051)Termination reason: Refutation not found, incomplete strategy
% 0.25/0.49
% 0.25/0.49
% 0.25/0.49 % (9051)Memory used [KB]: 5628
% 0.25/0.49 % (9051)Time elapsed: 0.008 s
% 0.25/0.49 % (9051)Instructions burned: 12 (million)
% 0.25/0.49 % (9051)------------------------------
% 0.25/0.49 % (9051)------------------------------
% 0.25/0.49 % (9053)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.25/0.49 % (9053)Instruction limit reached!
% 0.25/0.49 % (9053)------------------------------
% 0.25/0.49 % (9053)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.49 % (9053)Termination reason: Unknown
% 0.25/0.49 % (9053)Termination phase: Property scanning
% 0.25/0.49
% 0.25/0.49 % (9053)Memory used [KB]: 1151
% 0.25/0.49 % (9053)Time elapsed: 0.005 s
% 0.25/0.49 % (9053)Instructions burned: 5 (million)
% 0.25/0.49 % (9053)------------------------------
% 0.25/0.49 % (9053)------------------------------
% 0.25/0.49 % (9052)Instruction limit reached!
% 0.25/0.49 % (9052)------------------------------
% 0.25/0.49 % (9052)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.49 % (9052)Termination reason: Unknown
% 0.25/0.49 % (9052)Termination phase: Saturation
% 0.25/0.49
% 0.25/0.49 % (9052)Memory used [KB]: 5756
% 0.25/0.49 % (9052)Time elapsed: 0.013 s
% 0.25/0.49 % (9052)Instructions burned: 21 (million)
% 0.25/0.49 % (9052)------------------------------
% 0.25/0.49 % (9052)------------------------------
% 0.25/0.49 % (9054)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.25/0.50 % (9040)First to succeed.
% 0.25/0.50 % (9054)Instruction limit reached!
% 0.25/0.50 % (9054)------------------------------
% 0.25/0.50 % (9054)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.50 % (9054)Termination reason: Unknown
% 0.25/0.50 % (9054)Termination phase: Property scanning
% 0.25/0.50
% 0.25/0.50 % (9054)Memory used [KB]: 1151
% 0.25/0.50 % (9054)Time elapsed: 0.006 s
% 0.25/0.50 % (9054)Instructions burned: 7 (million)
% 0.25/0.50 % (9054)------------------------------
% 0.25/0.50 % (9054)------------------------------
% 0.25/0.50 % (9055)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.25/0.50 % (9056)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.25/0.50 % (9040)Refutation found. Thanks to Tanya!
% 0.25/0.50 % SZS status Theorem for theBenchmark
% 0.25/0.50 % SZS output start Proof for theBenchmark
% 0.25/0.50 thf(type_def_5, type, mu: $tType).
% 0.25/0.50 thf(type_def_7, type, reg: $tType).
% 0.25/0.50 thf(func_def_0, type, mu: $tType).
% 0.25/0.50 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.25/0.50 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_15, type, mtrue: $i > $o).
% 0.25/0.50 thf(func_def_16, type, mfalse: $i > $o).
% 0.25/0.50 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.25/0.50 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.25/0.50 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.25/0.50 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.25/0.50 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.25/0.50 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.25/0.50 thf(func_def_33, type, reg: $tType).
% 0.25/0.50 thf(func_def_34, type, c: reg > reg > $o).
% 0.25/0.50 thf(func_def_35, type, dc: reg > reg > $o).
% 0.25/0.50 thf(func_def_36, type, p: reg > reg > $o).
% 0.25/0.50 thf(func_def_37, type, eq: reg > reg > $o).
% 0.25/0.50 thf(func_def_38, type, o: reg > reg > $o).
% 0.25/0.50 thf(func_def_39, type, po: reg > reg > $o).
% 0.25/0.50 thf(func_def_40, type, ec: reg > reg > $o).
% 0.25/0.50 thf(func_def_41, type, pp: reg > reg > $o).
% 0.25/0.50 thf(func_def_42, type, tpp: reg > reg > $o).
% 0.25/0.50 thf(func_def_43, type, ntpp: reg > reg > $o).
% 0.25/0.50 thf(func_def_44, type, catalunya: reg).
% 0.25/0.50 thf(func_def_45, type, france: reg).
% 0.25/0.50 thf(func_def_46, type, spain: reg).
% 0.25/0.50 thf(func_def_47, type, paris: reg).
% 0.25/0.50 thf(func_def_48, type, a: $i > $i > $o).
% 0.25/0.50 thf(func_def_49, type, fool: $i > $i > $o).
% 0.25/0.50 thf(func_def_66, type, ph1: !>[X0: $tType]:(X0)).
% 0.25/0.50 thf(func_def_70, type, sK5: reg).
% 0.25/0.50 thf(func_def_71, type, sK6: reg).
% 0.25/0.50 thf(func_def_72, type, sK7: reg).
% 0.25/0.50 thf(func_def_73, type, sK8: reg).
% 0.25/0.50 thf(f548,plain,(
% 0.25/0.50 $false),
% 0.25/0.50 inference(trivial_inequality_removal,[],[f547])).
% 0.25/0.50 thf(f547,plain,(
% 0.25/0.50 ($false = $true)),
% 0.25/0.50 inference(beta_eta_normalization,[],[f546])).
% 0.25/0.50 thf(f546,plain,(
% 0.25/0.50 ($false = ((^[Y0 : reg]: ($true)) @ sK8))),
% 0.25/0.50 inference(sigma_clausification,[],[f493])).
% 0.25/0.50 thf(f493,plain,(
% 0.25/0.50 ((!! @ reg @ (^[Y0 : reg]: ($true))) = $false)),
% 0.25/0.50 inference(boolean_simplification,[],[f492])).
% 0.25/0.50 thf(f492,plain,(
% 0.25/0.50 (($true & (!! @ reg @ (^[Y0 : reg]: ($true)))) = $false)),
% 0.25/0.50 inference(forward_demodulation,[],[f491,f463])).
% 0.25/0.50 thf(f463,plain,(
% 0.25/0.50 ((!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france)))) = $true)),
% 0.25/0.50 inference(binary_proxy_clausification,[],[f408])).
% 0.25/0.50 thf(f408,plain,(
% 0.25/0.50 (((~ (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) = $true)),
% 0.25/0.50 inference(binary_proxy_clausification,[],[f367])).
% 0.25/0.50 thf(f367,plain,(
% 0.25/0.50 ($true = (((~ (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (~ (?? @ reg @ (^[Y0 : reg]: (((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ paris)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ paris)) & ((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ france))))))))),
% 0.25/0.50 inference(boolean_simplification,[],[f366])).
% 0.25/0.50 thf(f366,plain,(
% 0.25/0.50 (($false | (((~ (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (~ (?? @ reg @ (^[Y0 : reg]: (((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ paris)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ paris)) & ((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ france)))))))) = $true)),
% 0.25/0.50 inference(boolean_simplification,[],[f363])).
% 0.25/0.50 thf(f363,plain,(
% 0.25/0.50 (((~ $true) | (((~ (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (~ (?? @ reg @ (^[Y0 : reg]: (((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ paris)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ paris)) & ((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ france)))))))) = $true)),
% 0.25/0.50 inference(superposition,[],[f344,f308])).
% 0.25/0.50 thf(f308,plain,(
% 0.25/0.50 ((a @ sK2 @ sK3) = $true)),
% 0.25/0.50 inference(not_proxy_clausification,[],[f296])).
% 0.25/0.50 thf(f296,plain,(
% 0.25/0.50 ($false = (~ (a @ sK2 @ sK3)))),
% 0.25/0.50 inference(binary_proxy_clausification,[],[f294])).
% 0.25/0.50 thf(f294,plain,(
% 0.25/0.50 ($false = ((~ (a @ sK2 @ sK3)) | (?? @ reg @ (^[Y0 : reg]: (?? @ reg @ (^[Y1 : reg]: (((~ ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ Y1)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ france))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france)))))))))))),
% 0.25/0.50 inference(beta_eta_normalization,[],[f293])).
% 0.25/0.50 thf(f293,plain,(
% 0.25/0.50 ($false = ((^[Y0 : $i]: ((~ (a @ sK2 @ Y0)) | (?? @ reg @ (^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: (((~ ((!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y1) => (c @ Y3 @ Y2)))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ Y1)))))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y1) => (c @ Y3 @ france))))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ france))))))))))) @ sK3))),
% 0.25/0.50 inference(sigma_clausification,[],[f292])).
% 0.25/0.50 thf(f292,plain,(
% 0.25/0.50 ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (a @ sK2 @ Y0)) | (?? @ reg @ (^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: (((~ ((!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y1) => (c @ Y3 @ Y2)))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ Y1)))))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y1) => (c @ Y3 @ france))))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ france)))))))))))))),
% 0.25/0.50 inference(beta_eta_normalization,[],[f291])).
% 0.25/0.50 thf(f291,plain,(
% 0.25/0.50 (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (a @ Y0 @ Y1)) | (?? @ reg @ (^[Y2 : reg]: (?? @ reg @ (^[Y3 : reg]: (((~ ((!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ Y3)))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ Y2)))))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ france))))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ france))))))))))))) @ sK2) = $false)),
% 0.25/0.50 inference(sigma_clausification,[],[f288])).
% 0.25/0.50 thf(f288,plain,(
% 0.25/0.50 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (a @ Y0 @ Y1)) | (?? @ reg @ (^[Y2 : reg]: (?? @ reg @ (^[Y3 : reg]: (((~ ((!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ Y3)))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ Y2)))))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ france))))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ france)))))))))))))) = $false)),
% 0.25/0.50 inference(not_proxy_clausification,[],[f223])).
% 0.25/0.50 thf(f223,plain,(
% 0.25/0.50 ((~ (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (a @ Y0 @ Y1)) | (?? @ reg @ (^[Y2 : reg]: (?? @ reg @ (^[Y3 : reg]: (((~ ((!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ Y3)))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ Y2)))))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ france))))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ france))))))))))))))) = $true)),
% 0.25/0.50 inference(beta_eta_normalization,[],[f213])).
% 0.25/0.50 thf(f213,plain,(
% 0.25/0.50 ((~ ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ a @ (^[Y0 : $i]: (?? @ reg @ (^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: (((~ ((^[Y3 : reg]: ((^[Y4 : reg]: (((^[Y5 : reg]: ((^[Y6 : reg]: (!! @ reg @ (^[Y7 : reg]: ((c @ Y7 @ Y5) => (c @ Y7 @ Y6))))))) @ Y3 @ Y4) & ((^[Y5 : reg]: ((^[Y6 : reg]: (!! @ reg @ (^[Y7 : reg]: ((c @ Y7 @ Y5) => (c @ Y7 @ Y6))))))) @ Y4 @ Y3))))) @ Y1 @ Y2)) & ((^[Y3 : reg]: ((^[Y4 : reg]: (!! @ reg @ (^[Y5 : reg]: ((c @ Y5 @ Y3) => (c @ Y5 @ Y4))))))) @ Y1 @ france)) & ((^[Y3 : reg]: ((^[Y4 : reg]: (!! @ reg @ (^[Y5 : reg]: ((c @ Y5 @ Y3) => (c @ Y5 @ Y4))))))) @ Y2 @ france)))))))))) = $true)),
% 0.25/0.50 inference(definition_unfolding,[],[f157,f149,f153,f205,f189,f189])).
% 0.25/0.50 thf(f189,plain,(
% 0.25/0.50 (p = (^[Y0 : reg]: ((^[Y1 : reg]: (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ Y1))))))))),
% 0.25/0.50 inference(cnf_transformation,[],[f58])).
% 0.25/0.50 thf(f58,plain,(
% 0.25/0.50 (p = (^[Y0 : reg]: ((^[Y1 : reg]: (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ Y1))))))))),
% 0.25/0.50 inference(fool_elimination,[],[f57])).
% 0.25/0.50 thf(f57,plain,(
% 0.25/0.50 (p = (^[X0 : reg, X1 : reg] : (! [X2 : reg] : ((c @ X2 @ X0) => (c @ X2 @ X1)))))),
% 0.25/0.50 inference(rectify,[],[f35])).
% 0.25/0.50 thf(f35,axiom,(
% 0.25/0.50 (p = (^[X0 : reg, X1 : reg] : (! [X11 : reg] : ((c @ X11 @ X0) => (c @ X11 @ X1)))))),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p)).
% 0.25/0.50 thf(f205,plain,(
% 0.25/0.50 (eq = (^[Y0 : reg]: ((^[Y1 : reg]: (((^[Y2 : reg]: ((^[Y3 : reg]: (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ Y3))))))) @ Y0 @ Y1) & ((^[Y2 : reg]: ((^[Y3 : reg]: (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ Y3))))))) @ Y1 @ Y0))))))),
% 0.25/0.50 inference(definition_unfolding,[],[f185,f189,f189])).
% 0.25/0.50 thf(f185,plain,(
% 0.25/0.50 (eq = (^[Y0 : reg]: ((^[Y1 : reg]: ((p @ Y0 @ Y1) & (p @ Y1 @ Y0))))))),
% 0.25/0.50 inference(cnf_transformation,[],[f67])).
% 0.25/0.50 thf(f67,plain,(
% 0.25/0.50 (eq = (^[Y0 : reg]: ((^[Y1 : reg]: ((p @ Y0 @ Y1) & (p @ Y1 @ Y0))))))),
% 0.25/0.50 inference(fool_elimination,[],[f66])).
% 0.25/0.50 thf(f66,plain,(
% 0.25/0.50 ((^[X0 : reg, X1 : reg] : ((p @ X1 @ X0) & (p @ X0 @ X1))) = eq)),
% 0.25/0.50 inference(rectify,[],[f36])).
% 0.25/0.50 thf(f36,axiom,(
% 0.25/0.50 ((^[X0 : reg, X1 : reg] : ((p @ X1 @ X0) & (p @ X0 @ X1))) = eq)),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq)).
% 0.25/0.50 thf(f153,plain,(
% 0.25/0.50 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.25/0.50 inference(cnf_transformation,[],[f130])).
% 0.25/0.50 thf(f130,plain,(
% 0.25/0.50 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.25/0.50 inference(fool_elimination,[],[f129])).
% 0.25/0.50 thf(f129,plain,(
% 0.25/0.50 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X1 @ X3) | ~(X0 @ X2 @ X3)))) = mbox)),
% 0.25/0.50 inference(rectify,[],[f16])).
% 0.25/0.50 thf(f16,axiom,(
% 0.25/0.50 ((^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(X6 @ X2 @ X7)))) = mbox)),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.25/0.50 thf(f149,plain,(
% 0.25/0.50 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.25/0.50 inference(cnf_transformation,[],[f93])).
% 0.25/0.50 thf(f93,plain,(
% 0.25/0.50 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.25/0.50 inference(fool_elimination,[],[f92])).
% 0.25/0.50 thf(f92,plain,(
% 0.25/0.50 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.25/0.50 inference(rectify,[],[f28])).
% 0.25/0.50 thf(f28,axiom,(
% 0.25/0.50 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.25/0.50 thf(f157,plain,(
% 0.25/0.50 ((~ (mvalid @ (mbox @ a @ (^[Y0 : $i]: (?? @ reg @ (^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: (((~ (eq @ Y1 @ Y2)) & (p @ Y1 @ france)) & (p @ Y2 @ france)))))))))) = $true)),
% 0.25/0.50 inference(cnf_transformation,[],[f140])).
% 0.25/0.50 thf(f140,plain,(
% 0.25/0.50 ((~ (mvalid @ (mbox @ a @ (^[Y0 : $i]: (?? @ reg @ (^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: (((~ (eq @ Y1 @ Y2)) & (p @ Y1 @ france)) & (p @ Y2 @ france)))))))))) = $true)),
% 0.25/0.50 inference(fool_elimination,[],[f139])).
% 0.25/0.50 thf(f139,plain,(
% 0.25/0.50 ~(mvalid @ (mbox @ a @ (^[X0 : $i] : (? [X1 : reg,X2 : reg] : ((p @ X1 @ france) & (p @ X2 @ france) & ~(eq @ X2 @ X1))))))),
% 0.25/0.50 inference(rectify,[],[f50])).
% 0.25/0.50 thf(f50,negated_conjecture,(
% 0.25/0.50 ~(mvalid @ (mbox @ a @ (^[X0 : $i] : (? [X1 : reg,X11 : reg] : ((p @ X1 @ france) & (p @ X11 @ france) & ~(eq @ X11 @ X1))))))),
% 0.25/0.50 inference(negated_conjecture,[],[f49])).
% 0.25/0.50 thf(f49,conjecture,(
% 0.25/0.50 (mvalid @ (mbox @ a @ (^[X0 : $i] : (? [X1 : reg,X11 : reg] : ((p @ X1 @ france) & (p @ X11 @ france) & ~(eq @ X11 @ X1))))))),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con)).
% 0.25/0.50 thf(f344,plain,(
% 0.25/0.50 ( ! [X2 : $i,X1 : $i] : ((((~ (a @ X1 @ X2)) | (((~ (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (~ (?? @ reg @ (^[Y0 : reg]: (((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ paris)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ paris)) & ((~ (?? @ reg @ (^[Y1 : reg]: ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))))) & (c @ Y0 @ france)))))))) = $true)) )),
% 0.25/0.50 inference(beta_eta_normalization,[],[f343])).
% 0.25/0.50 thf(f343,plain,(
% 0.25/0.50 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((~ (a @ X1 @ Y0)) | (((~ (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ france) => (c @ Y1 @ paris))))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ paris) => (c @ Y1 @ france))))) & (~ (?? @ reg @ (^[Y1 : reg]: (((~ (?? @ reg @ (^[Y2 : reg]: ((!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ paris)))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ Y1)))))))) & (c @ Y1 @ paris)) & ((~ (?? @ reg @ (^[Y2 : reg]: ((!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ france)))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ Y1)))))))) & (c @ Y1 @ france))))))))) @ X2) = $true)) )),
% 0.25/0.50 inference(pi_clausification,[],[f338])).
% 0.25/0.50 thf(f338,plain,(
% 0.25/0.50 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((~ (a @ X1 @ Y0)) | (((~ (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ france) => (c @ Y1 @ paris))))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ paris) => (c @ Y1 @ france))))) & (~ (?? @ reg @ (^[Y1 : reg]: (((~ (?? @ reg @ (^[Y2 : reg]: ((!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ paris)))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ Y1)))))))) & (c @ Y1 @ paris)) & ((~ (?? @ reg @ (^[Y2 : reg]: ((!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ france)))) & (!! @ reg @ (^[Y3 : reg]: ((c @ Y3 @ Y2) => (c @ Y3 @ Y1)))))))) & (c @ Y1 @ france)))))))))) = $true)) )),
% 0.25/0.50 inference(beta_eta_normalization,[],[f337])).
% 0.25/0.50 thf(f337,plain,(
% 0.25/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (a @ Y0 @ Y1)) | (((~ (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ france) => (c @ Y2 @ paris))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ paris) => (c @ Y2 @ france))))) & (~ (?? @ reg @ (^[Y2 : reg]: (((~ (?? @ reg @ (^[Y3 : reg]: ((!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ paris)))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ Y2)))))))) & (c @ Y2 @ paris)) & ((~ (?? @ reg @ (^[Y3 : reg]: ((!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ france)))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ Y2)))))))) & (c @ Y2 @ france))))))))))) @ X1) = $true)) )),
% 0.25/0.50 inference(pi_clausification,[],[f225])).
% 0.25/0.50 thf(f225,plain,(
% 0.25/0.50 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (a @ Y0 @ Y1)) | (((~ (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ france) => (c @ Y2 @ paris))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ paris) => (c @ Y2 @ france))))) & (~ (?? @ reg @ (^[Y2 : reg]: (((~ (?? @ reg @ (^[Y3 : reg]: ((!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ paris)))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ Y2)))))))) & (c @ Y2 @ paris)) & ((~ (?? @ reg @ (^[Y3 : reg]: ((!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ france)))) & (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y3) => (c @ Y4 @ Y2)))))))) & (c @ Y2 @ france)))))))))))) = $true)),
% 0.25/0.50 inference(beta_eta_normalization,[],[f214])).
% 0.25/0.50 thf(f214,plain,(
% 0.25/0.50 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))) @ a @ (^[Y0 : $i]: ((^[Y1 : reg]: ((^[Y2 : reg]: (((^[Y3 : reg]: ((^[Y4 : reg]: ((~ ((^[Y5 : reg]: ((^[Y6 : reg]: (!! @ reg @ (^[Y7 : reg]: ((c @ Y7 @ Y5) => (c @ Y7 @ Y6))))))) @ Y4 @ Y3)) & ((^[Y5 : reg]: ((^[Y6 : reg]: (!! @ reg @ (^[Y7 : reg]: ((c @ Y7 @ Y5) => (c @ Y7 @ Y6))))))) @ Y3 @ Y4))))) @ Y1 @ Y2) & (~ (?? @ reg @ (^[Y3 : reg]: (((^[Y4 : reg]: ((^[Y5 : reg]: ((~ ((^[Y6 : reg]: ((^[Y7 : reg]: (?? @ reg @ (^[Y8 : reg]: (((^[Y9 : reg]: ((^[Y10 : reg]: (!! @ reg @ (^[Y11 : reg]: ((c @ Y11 @ Y9) => (c @ Y11 @ Y10))))))) @ Y8 @ Y7) & ((^[Y9 : reg]: ((^[Y10 : reg]: (!! @ reg @ (^[Y11 : reg]: ((c @ Y11 @ Y9) => (c @ Y11 @ Y10))))))) @ Y8 @ Y6))))))) @ Y4 @ Y5)) & (c @ Y4 @ Y5))))) @ Y3 @ Y1) & ((^[Y4 : reg]: ((^[Y5 : reg]: ((~ ((^[Y6 : reg]: ((^[Y7 : reg]: (?? @ reg @ (^[Y8 : reg]: (((^[Y9 : reg]: ((^[Y10 : reg]: (!! @ reg @ (^[Y11 : reg]: ((c @ Y11 @ Y9) => (c @ Y11 @ Y10))))))) @ Y8 @ Y7) & ((^[Y9 : reg]: ((^[Y10 : reg]: (!! @ reg @ (^[Y11 : reg]: ((c @ Y11 @ Y9) => (c @ Y11 @ Y10))))))) @ Y8 @ Y6))))))) @ Y4 @ Y5)) & (c @ Y4 @ Y5))))) @ Y3 @ Y2))))))))) @ paris @ france)))) = $true)),
% 0.25/0.50 inference(definition_unfolding,[],[f159,f149,f153,f211])).
% 0.25/0.50 thf(f211,plain,(
% 0.25/0.50 (ntpp = (^[Y0 : reg]: ((^[Y1 : reg]: (((^[Y2 : reg]: ((^[Y3 : reg]: ((~ ((^[Y4 : reg]: ((^[Y5 : reg]: (!! @ reg @ (^[Y6 : reg]: ((c @ Y6 @ Y4) => (c @ Y6 @ Y5))))))) @ Y3 @ Y2)) & ((^[Y4 : reg]: ((^[Y5 : reg]: (!! @ reg @ (^[Y6 : reg]: ((c @ Y6 @ Y4) => (c @ Y6 @ Y5))))))) @ Y2 @ Y3))))) @ Y0 @ Y1) & (~ (?? @ reg @ (^[Y2 : reg]: (((^[Y3 : reg]: ((^[Y4 : reg]: ((~ ((^[Y5 : reg]: ((^[Y6 : reg]: (?? @ reg @ (^[Y7 : reg]: (((^[Y8 : reg]: ((^[Y9 : reg]: (!! @ reg @ (^[Y10 : reg]: ((c @ Y10 @ Y8) => (c @ Y10 @ Y9))))))) @ Y7 @ Y6) & ((^[Y8 : reg]: ((^[Y9 : reg]: (!! @ reg @ (^[Y10 : reg]: ((c @ Y10 @ Y8) => (c @ Y10 @ Y9))))))) @ Y7 @ Y5))))))) @ Y3 @ Y4)) & (c @ Y3 @ Y4))))) @ Y2 @ Y0) & ((^[Y3 : reg]: ((^[Y4 : reg]: ((~ ((^[Y5 : reg]: ((^[Y6 : reg]: (?? @ reg @ (^[Y7 : reg]: (((^[Y8 : reg]: ((^[Y9 : reg]: (!! @ reg @ (^[Y10 : reg]: ((c @ Y10 @ Y8) => (c @ Y10 @ Y9))))))) @ Y7 @ Y6) & ((^[Y8 : reg]: ((^[Y9 : reg]: (!! @ reg @ (^[Y10 : reg]: ((c @ Y10 @ Y8) => (c @ Y10 @ Y9))))))) @ Y7 @ Y5))))))) @ Y3 @ Y4)) & (c @ Y3 @ Y4))))) @ Y2 @ Y1))))))))))),
% 0.25/0.50 inference(definition_unfolding,[],[f170,f209,f208,f208])).
% 0.25/0.50 thf(f208,plain,(
% 0.25/0.50 (ec = (^[Y0 : reg]: ((^[Y1 : reg]: ((~ ((^[Y2 : reg]: ((^[Y3 : reg]: (?? @ reg @ (^[Y4 : reg]: (((^[Y5 : reg]: ((^[Y6 : reg]: (!! @ reg @ (^[Y7 : reg]: ((c @ Y7 @ Y5) => (c @ Y7 @ Y6))))))) @ Y4 @ Y3) & ((^[Y5 : reg]: ((^[Y6 : reg]: (!! @ reg @ (^[Y7 : reg]: ((c @ Y7 @ Y5) => (c @ Y7 @ Y6))))))) @ Y4 @ Y2))))))) @ Y0 @ Y1)) & (c @ Y0 @ Y1))))))),
% 0.25/0.50 inference(definition_unfolding,[],[f150,f206])).
% 0.25/0.50 thf(f206,plain,(
% 0.25/0.50 (o = (^[Y0 : reg]: ((^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: (((^[Y3 : reg]: ((^[Y4 : reg]: (!! @ reg @ (^[Y5 : reg]: ((c @ Y5 @ Y3) => (c @ Y5 @ Y4))))))) @ Y2 @ Y1) & ((^[Y3 : reg]: ((^[Y4 : reg]: (!! @ reg @ (^[Y5 : reg]: ((c @ Y5 @ Y3) => (c @ Y5 @ Y4))))))) @ Y2 @ Y0))))))))),
% 0.25/0.50 inference(definition_unfolding,[],[f167,f189,f189])).
% 0.25/0.50 thf(f167,plain,(
% 0.25/0.50 (o = (^[Y0 : reg]: ((^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: ((p @ Y2 @ Y1) & (p @ Y2 @ Y0))))))))),
% 0.25/0.50 inference(cnf_transformation,[],[f53])).
% 0.25/0.50 thf(f53,plain,(
% 0.25/0.50 (o = (^[Y0 : reg]: ((^[Y1 : reg]: (?? @ reg @ (^[Y2 : reg]: ((p @ Y2 @ Y1) & (p @ Y2 @ Y0))))))))),
% 0.25/0.50 inference(fool_elimination,[],[f52])).
% 0.25/0.50 thf(f52,plain,(
% 0.25/0.50 (o = (^[X0 : reg, X1 : reg] : (? [X2 : reg] : ((p @ X2 @ X0) & (p @ X2 @ X1)))))),
% 0.25/0.50 inference(rectify,[],[f37])).
% 0.25/0.50 thf(f37,axiom,(
% 0.25/0.50 (o = (^[X0 : reg, X1 : reg] : (? [X11 : reg] : ((p @ X11 @ X0) & (p @ X11 @ X1)))))),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',o)).
% 0.25/0.50 thf(f150,plain,(
% 0.25/0.50 (ec = (^[Y0 : reg]: ((^[Y1 : reg]: ((~ (o @ Y0 @ Y1)) & (c @ Y0 @ Y1))))))),
% 0.25/0.50 inference(cnf_transformation,[],[f114])).
% 0.25/0.50 thf(f114,plain,(
% 0.25/0.50 (ec = (^[Y0 : reg]: ((^[Y1 : reg]: ((~ (o @ Y0 @ Y1)) & (c @ Y0 @ Y1))))))),
% 0.25/0.50 inference(fool_elimination,[],[f113])).
% 0.25/0.50 thf(f113,plain,(
% 0.25/0.50 (ec = (^[X0 : reg, X1 : reg] : ((c @ X0 @ X1) & ~(o @ X0 @ X1))))),
% 0.25/0.50 inference(rectify,[],[f39])).
% 0.25/0.50 thf(f39,axiom,(
% 0.25/0.50 (ec = (^[X0 : reg, X1 : reg] : ((c @ X0 @ X1) & ~(o @ X0 @ X1))))),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ec)).
% 0.25/0.50 thf(f209,plain,(
% 0.25/0.50 (pp = (^[Y0 : reg]: ((^[Y1 : reg]: ((~ ((^[Y2 : reg]: ((^[Y3 : reg]: (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ Y3))))))) @ Y1 @ Y0)) & ((^[Y2 : reg]: ((^[Y3 : reg]: (!! @ reg @ (^[Y4 : reg]: ((c @ Y4 @ Y2) => (c @ Y4 @ Y3))))))) @ Y0 @ Y1))))))),
% 0.25/0.50 inference(definition_unfolding,[],[f188,f189,f189])).
% 0.25/0.50 thf(f188,plain,(
% 0.25/0.50 (pp = (^[Y0 : reg]: ((^[Y1 : reg]: ((~ (p @ Y1 @ Y0)) & (p @ Y0 @ Y1))))))),
% 0.25/0.50 inference(cnf_transformation,[],[f65])).
% 0.25/0.50 thf(f65,plain,(
% 0.25/0.50 (pp = (^[Y0 : reg]: ((^[Y1 : reg]: ((~ (p @ Y1 @ Y0)) & (p @ Y0 @ Y1))))))),
% 0.25/0.50 inference(fool_elimination,[],[f64])).
% 0.25/0.50 thf(f64,plain,(
% 0.25/0.50 (pp = (^[X0 : reg, X1 : reg] : ((p @ X0 @ X1) & ~(p @ X1 @ X0))))),
% 0.25/0.50 inference(rectify,[],[f40])).
% 0.25/0.50 thf(f40,axiom,(
% 0.25/0.50 (pp = (^[X0 : reg, X1 : reg] : ((p @ X0 @ X1) & ~(p @ X1 @ X0))))),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pp)).
% 0.25/0.50 thf(f170,plain,(
% 0.25/0.50 (ntpp = (^[Y0 : reg]: ((^[Y1 : reg]: ((pp @ Y0 @ Y1) & (~ (?? @ reg @ (^[Y2 : reg]: ((ec @ Y2 @ Y0) & (ec @ Y2 @ Y1))))))))))),
% 0.25/0.50 inference(cnf_transformation,[],[f138])).
% 0.25/0.50 thf(f138,plain,(
% 0.25/0.50 (ntpp = (^[Y0 : reg]: ((^[Y1 : reg]: ((pp @ Y0 @ Y1) & (~ (?? @ reg @ (^[Y2 : reg]: ((ec @ Y2 @ Y0) & (ec @ Y2 @ Y1))))))))))),
% 0.25/0.50 inference(fool_elimination,[],[f137])).
% 0.25/0.50 thf(f137,plain,(
% 0.25/0.50 (ntpp = (^[X0 : reg, X1 : reg] : (~? [X2 : reg] : ((ec @ X2 @ X1) & (ec @ X2 @ X0)) & (pp @ X0 @ X1))))),
% 0.25/0.50 inference(rectify,[],[f42])).
% 0.25/0.50 thf(f42,axiom,(
% 0.25/0.50 (ntpp = (^[X0 : reg, X1 : reg] : (~? [X11 : reg] : ((ec @ X11 @ X1) & (ec @ X11 @ X0)) & (pp @ X0 @ X1))))),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ntpp)).
% 0.25/0.50 thf(f159,plain,(
% 0.25/0.50 ((mvalid @ (mbox @ a @ (^[Y0 : $i]: (ntpp @ paris @ france)))) = $true)),
% 0.25/0.50 inference(cnf_transformation,[],[f124])).
% 0.25/0.50 thf(f124,plain,(
% 0.25/0.50 ((mvalid @ (mbox @ a @ (^[Y0 : $i]: (ntpp @ paris @ france)))) = $true)),
% 0.25/0.50 inference(fool_elimination,[],[f123])).
% 0.25/0.50 thf(f123,plain,(
% 0.25/0.50 (mvalid @ (mbox @ a @ (^[X0 : $i] : (ntpp @ paris @ france))))),
% 0.25/0.50 inference(rectify,[],[f48])).
% 0.25/0.50 thf(f48,axiom,(
% 0.25/0.50 (mvalid @ (mbox @ a @ (^[X0 : $i] : (ntpp @ paris @ france))))),
% 0.25/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)).
% 0.25/0.50 thf(f491,plain,(
% 0.25/0.50 (((!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france)))) & (!! @ reg @ (^[Y0 : reg]: ($true)))) = $false)),
% 0.25/0.50 inference(boolean_simplification,[],[f490])).
% 0.25/0.50 thf(f490,plain,(
% 0.25/0.50 ((($true & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (!! @ reg @ (^[Y0 : reg]: ($true)))) = $false)),
% 0.25/0.50 inference(boolean_simplification,[],[f489])).
% 0.25/0.50 thf(f489,plain,(
% 0.25/0.50 ($false = (((~ $false) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (!! @ reg @ (^[Y0 : reg]: ($true)))))),
% 0.25/0.50 inference(boolean_simplification,[],[f488])).
% 0.25/0.50 thf(f488,plain,(
% 0.25/0.50 ($false = (((~ ((!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france)))) & $false)) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (!! @ reg @ (^[Y0 : reg]: ($true)))))),
% 0.25/0.50 inference(boolean_simplification,[],[f481])).
% 0.25/0.50 thf(f481,plain,(
% 0.25/0.50 ($false = (((~ ((!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france)))) & $false)) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ paris) => (c @ Y0 @ france))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ france))))))),
% 0.25/0.50 inference(superposition,[],[f316,f473])).
% 0.25/0.50 thf(f473,plain,(
% 0.25/0.50 ($false = (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris)))))),
% 0.25/0.50 inference(not_proxy_clausification,[],[f466])).
% 0.25/0.50 thf(f466,plain,(
% 0.25/0.50 ($true = (~ (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris))))))),
% 0.25/0.50 inference(boolean_simplification,[],[f465])).
% 0.25/0.50 thf(f465,plain,(
% 0.25/0.50 (((~ (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ france) => (c @ Y0 @ paris))))) & $true) = $true)),
% 0.25/0.50 inference(backward_demodulation,[],[f408,f463])).
% 0.25/0.50 thf(f316,plain,(
% 0.25/0.50 ( ! [X2 : reg,X1 : reg] : (($false = (((~ ((!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ X1) => (c @ Y0 @ X2)))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ X2) => (c @ Y0 @ X1)))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ X1) => (c @ Y0 @ france))))) & (!! @ reg @ (^[Y0 : reg]: ((c @ Y0 @ X2) => (c @ Y0 @ france))))))) )),
% 0.25/0.50 inference(beta_eta_normalization,[],[f315])).
% 0.25/0.50 thf(f315,plain,(
% 0.25/0.50 ( ! [X2 : reg,X1 : reg] : (($false = ((^[Y0 : reg]: (((~ ((!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ X1) => (c @ Y1 @ Y0)))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ Y0) => (c @ Y1 @ X1)))))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ X1) => (c @ Y1 @ france))))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ Y0) => (c @ Y1 @ france)))))) @ X2))) )),
% 0.25/0.50 inference(pi_clausification,[],[f312])).
% 0.25/0.50 thf(f312,plain,(
% 0.25/0.50 ( ! [X1 : reg] : (($false = (?? @ reg @ (^[Y0 : reg]: (((~ ((!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ X1) => (c @ Y1 @ Y0)))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ Y0) => (c @ Y1 @ X1)))))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ X1) => (c @ Y1 @ france))))) & (!! @ reg @ (^[Y1 : reg]: ((c @ Y1 @ Y0) => (c @ Y1 @ france))))))))) )),
% 0.25/0.50 inference(beta_eta_normalization,[],[f311])).
% 0.25/0.50 thf(f311,plain,(
% 0.25/0.50 ( ! [X1 : reg] : (($false = ((^[Y0 : reg]: (?? @ reg @ (^[Y1 : reg]: (((~ ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ Y1)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ france))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france)))))))) @ X1))) )),
% 0.25/0.50 inference(pi_clausification,[],[f298])).
% 0.25/0.50 thf(f298,plain,(
% 0.25/0.50 ($false = (?? @ reg @ (^[Y0 : reg]: (?? @ reg @ (^[Y1 : reg]: (((~ ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ Y1)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ france))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france))))))))))),
% 0.25/0.50 inference(boolean_simplification,[],[f297])).
% 0.25/0.50 thf(f297,plain,(
% 0.25/0.50 (($false | (?? @ reg @ (^[Y0 : reg]: (?? @ reg @ (^[Y1 : reg]: (((~ ((!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ Y1)))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ Y0)))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y0) => (c @ Y2 @ france))))) & (!! @ reg @ (^[Y2 : reg]: ((c @ Y2 @ Y1) => (c @ Y2 @ france)))))))))) = $false)),
% 0.25/0.50 inference(backward_demodulation,[],[f294,f296])).
% 0.25/0.50 % SZS output end Proof for theBenchmark
% 0.25/0.50 % (9040)------------------------------
% 0.25/0.50 % (9040)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.50 % (9040)Termination reason: Refutation
% 0.25/0.50
% 0.25/0.50 % (9040)Memory used [KB]: 6268
% 0.25/0.50 % (9040)Time elapsed: 0.065 s
% 0.25/0.50 % (9040)Instructions burned: 97 (million)
% 0.25/0.50 % (9040)------------------------------
% 0.25/0.50 % (9040)------------------------------
% 0.25/0.50 % (9028)Success in time 0.096 s
% 0.25/0.50 % Vampire---4.8 exiting
%------------------------------------------------------------------------------